Multi-Prime RSA Over Galois Approach

Then choose an integer e with 1 < e < φ(n) and gcd (e, φ(n)) = 1. Then compute the integer d with 1 < d < φ(n) and de = 1modφ(n). Since gcd (e, φ(n)) = 1, such a number d exists. It can be computed by Extended Euclidean Algorithm. Public key is pair (n, e) and Private key is (d, p, q). n is called the RSA modulus ,e is encryption exponent and d is decryption exponent. Encryption: Let x ∈ Zn be the plaintext then x can be encrypted as ek(x) = x modn ek(x) = y is the ciphertext. Decryption: If y ∈ Zn is the ciphertext, then x can be computed as x = dk(y) = y modn.